Multilevel Circuit Partitioning for Computer - Aided VLSI Design

نویسندگان

  • Yongseok Cheon
  • Aloysius K. Mok
  • Martin D. F. Wong
  • Donald S. Fussell
  • Mohamed G. Gouda
  • David Z. Pan
  • Don Fussell
  • Mohamed Gouda
  • Gloria Ramirez
  • Seokjin Lee
  • Chan-Gun Lee
  • Honguk Woo
  • Dongyoung Lee
  • Eunhee Jang
چکیده

vii

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel cooperative search for the circuit/hypergraphpartitioning problem

The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present ...

متن کامل

Partitioning VLSI Circuits

Partitioning is a critical area of VLSI CAD. In order to build complex digital logic circuits it is often essential to sub-divide a circuit into smaller parts.Circuit partitioning plays an important role in physical design automation of very large scale integration(VLSI)chips.In VLSI.In VLSI circuit partitioning the problem of obtaining minimum cut is of prime importance.To enhance other criter...

متن کامل

Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning

In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...

متن کامل

Efficient Network Flow Based Ratio-Cut Netlist Hypergraph Partitioning

We present a new efficient heuristic that finds good ratio-cut bipartitions of hypergraphs that model large VLSI netlists. Ratio cut measure is given by the ratio of the number of nets cut between two blocks and the product of the cardinality (size) of each block. Hypergraphs model VLSI netlists in a more natural fashion than do graphs. Our new heuristic may be considered a hybrid between the a...

متن کامل

Ultra-Widband Distributed Amplifier Using Loss Compensation Technique on Both Input and Output Circuit

In this paper, we analyze a distributed amplifier based on input/output attenuation compensation. The analysis is carried out for a HEMT transistor; and a constant-k section filter is used to calculate the amplifier’s characteristics such as attenuation factor, phase constant and gain. The proposed design approach enables us to examine the tradeoff among the variables, which include the type an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004